periodic vehicle routing problem in reverse logistics with qualified customers
نویسندگان
چکیده
one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure of laws, reverse logistics (rl) has received increasing attention during recent years. reverse logistics includes all the activities in supply chain that happen as reverse manner. one of the critical issues in the development of reverse logistics at the operational level is routing problem. in this regard, the present study introduced a periodic vehicle routing with circumstance to supply of customer (collection centers) goods as a qualification condition for serving them. for this problem, a mixed integer nonlinear programming model is proposed. finally, to validate the proposed model, some examples have been solved by gams software.
منابع مشابه
A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملOn a periodic vehicle routing problem
This paper deals with a study on a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem, customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addition, the PVRP has a horizon, say T days, and there is a frequency for each customer stating how often within this T-day period this customer must ...
متن کاملa particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...
متن کاملPeriodic Sweep Coverage Scheme Based on Periodic Vehicle Routing Problem
We provide a sweep coverage algorithm for routing mobile sensors that communicate with a central data sink. This algorithm improves on its predecessors by reducing the number of unnecessary scans when different points of interest (POIs) have different requirements for the time interval within which they must be scanned (sweep period). Most sweep coverage algorithms seek to minimize the number o...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مدیریت زنجیره تأمینجلد ۱۷، شماره ۴۹، صفحات ۰-۰
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023